|
A Fibonacci word is a specific sequence of binary digits (or symbols from any two-letter alphabet). The Fibonacci word is formed by repeated concatenation in the same way that the Fibonacci numbers are formed by repeated addition. It is a paradigmatic example of a Sturmian word. The name “Fibonacci word” has also been used to refer to the members of a formal language ''L'' consisting of strings of zeros and ones with no two repeated ones. Any prefix of the specific Fibonacci word belongs to ''L'', but so do many other strings. ''L'' has a Fibonacci number of members of each possible length. == Definition == Let be "0" and be "01". Now (the concatenation of the previous sequence and the one before that). The infinite Fibonacci word is the limit . 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Fibonacci word」の詳細全文を読む スポンサード リンク
|